全文获取类型
收费全文 | 27025篇 |
免费 | 2384篇 |
国内免费 | 2388篇 |
专业分类
化学 | 3650篇 |
晶体学 | 97篇 |
力学 | 1911篇 |
综合类 | 667篇 |
数学 | 19298篇 |
物理学 | 6174篇 |
出版年
2023年 | 216篇 |
2022年 | 328篇 |
2021年 | 392篇 |
2020年 | 508篇 |
2019年 | 574篇 |
2018年 | 562篇 |
2017年 | 723篇 |
2016年 | 788篇 |
2015年 | 596篇 |
2014年 | 1127篇 |
2013年 | 1938篇 |
2012年 | 1205篇 |
2011年 | 1538篇 |
2010年 | 1482篇 |
2009年 | 1902篇 |
2008年 | 1944篇 |
2007年 | 1945篇 |
2006年 | 1729篇 |
2005年 | 1466篇 |
2004年 | 1249篇 |
2003年 | 1282篇 |
2002年 | 1078篇 |
2001年 | 878篇 |
2000年 | 789篇 |
1999年 | 778篇 |
1998年 | 697篇 |
1997年 | 632篇 |
1996年 | 511篇 |
1995年 | 360篇 |
1994年 | 320篇 |
1993年 | 269篇 |
1992年 | 264篇 |
1991年 | 202篇 |
1990年 | 165篇 |
1989年 | 146篇 |
1988年 | 123篇 |
1987年 | 100篇 |
1986年 | 71篇 |
1985年 | 130篇 |
1984年 | 97篇 |
1983年 | 69篇 |
1982年 | 107篇 |
1981年 | 90篇 |
1980年 | 64篇 |
1979年 | 91篇 |
1978年 | 73篇 |
1977年 | 55篇 |
1976年 | 39篇 |
1974年 | 26篇 |
1973年 | 28篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
SongIl Ri 《Indagationes Mathematicae》2018,29(3):962-971
The aim of this paper is to present a new idea to construct the nonlinear fractal interpolation function, in which we exploit the Matkowski and the Rakotch fixed point theorems. Our technique is different from the methods presented in the previous literatures. 相似文献
12.
Phan Quoc Khanh 《Numerical Functional Analysis & Optimization》2018,39(1):100-125
We propose a definition of a generalized type of Knaster–Kuratowski–Mazurkiewicz (KKM) mappings, called a weak T-KKM mapping, and a corresponding weak KKM property. A new extension of the Fan–Glicksberg fixed-point theorem is established. Sufficient conditions for the existence of a continuous selection, a fixed point of a composition, and a coincidence point are also provided. Then, we use the obtained results to study the existence of solutions to various optimization-related problems. Discussions and detailed examples are included as well to compare our results with existing ones and to explain their advantages in many situations. 相似文献
13.
Theo Steininger Jait Dixit Philipp Frank Maksim Greiner Sebastian Hutschenreuter Jakob Knollmüller Reimar Leike Natalia Porqueres Daniel Pumpe Martin Reinecke Matev raml Csongor Varady Torsten Enßlin 《Annalen der Physik》2019,531(3)
NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy 3, a major upgrade to the original NIFTy framework. NIFTy 3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy 3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy 3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 . 相似文献
14.
Pham Duy Khanh Tran Hong Mo Trinh T. T. Tran 《Numerical Functional Analysis & Optimization》2019,40(8):924-943
Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example. 相似文献
15.
Bilender P. Allahverdiev 《Mathematical Methods in the Applied Sciences》2019,42(1):229-236
In this study, maximal dissipative second‐order dynamic operators on semi‐infinite time scale are studied in the Hilbert space , that the extensions of a minimal symmetric operator in limit‐point case. We construct a self‐adjoint dilation of the dissipative operator together with its incoming and outgoing spectral representations so that we can determine the scattering function of the dilation as stated in the scheme of Lax‐Phillips. Moreover, we construct a functional model of the dissipative operator and identify its characteristic function in terms of the Weyl‐Titchmarsh function of a self‐adjoint second‐order dynamic operator. Finally, we prove the theorems on completeness of the system of root functions of the dissipative and accumulative dynamic operators. 相似文献
16.
In this paper, an unstable linear time invariant (LTI) ODE system is stabilized exponentially by the PDE compensato—a wave equation with Kelvin‐Voigt (K‐V) damping. Direct feedback connections between the ODE system and wave equation are established: The velocity of the wave equation enters the ODE through the variable vt(1,t); meanwhile, the output of the ODE is fluxed into the wave equation. It is found that the spectrum of the system operator is composed of two parts: point spectrum and continuous spectrum. The continuous spectrum consists of an isolated point , and there are two branches of asymptotic eigenvalues: the first branch approaches to , and the other branch tends to ?∞. It is shown that there is a sequence of generalized eigenfunctions, which forms a Riesz basis for the Hilbert state space. As a consequence, the spectrum‐determined growth condition and exponential stability of the system are concluded. 相似文献
17.
本文针对求矩阵方程AXB+CXD=F唯一解的参数迭代法,分析当矩阵A,B,C,D均是Hermite正(负)定矩阵时,迭代矩阵的特征值表达式,给出了最优参数的确定方法,并提出了相应的加速算法. 相似文献
18.
As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective. 相似文献
19.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time. 相似文献
20.